Divisor Counting Function as Convolution

Theorem

The divisor counting function can be expressed as the Dirichlet convolution

d=11

where 1 is the constant function 1(n)=1.

Proof
(11)(n)=dn1(d)1(dn)=dn1=d(n)